Least Squares Problems with Absolute Quadratic Constraints
نویسندگان
چکیده
This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a generalized theory following Bookstein’s conic-fitting and Fitzgibbon’s direct ellipse-specific fitting. Under simple preconditions, it can be shown that a minimum always exists and can be determined by a generalized eigenvalue problem. This problem is numerically reduced to an eigenvalue problem by multiplications of Givens’ rotations. Finally, four applications of this approach are presented.
منابع مشابه
Least squares problems with inequality constraints as quadratic constraints
Linear least squares problems with box constraints are commonly solved to find model parameters within bounds based on physical considerations. Common algorithms include Bounded Variable Least Squares (BVLS) and the Matlab function lsqlin. Here, we formulate the box constraints as quadratic constraints, and solve the corresponding unconstrained regularized least squares problem. Box constraints...
متن کاملSolving Mixed-Integer Quadratic Programs Via Nonnegative Least Squares
Abstract: This paper proposes a new algorithm for solving Mixed-Integer Quadratic Programming (MIQP) problems. The algorithm is particularly tailored to solving small-scale MIQPs such as those that arise in embedded hybrid Model Predictive Control (MPC) applications. The approach combines branch and bound (B&B) with nonnegative least squares (NNLS), that are used to solve Quadratic Programming ...
متن کاملA penalized method for multivariate concave least squares with application to productivity analysis
We propose a penalized method for the least squares estimator of a multivariate concave regression function. This estimator is formulated as a quadratic programming (QP) problem with O(n) constraints, where n is the number of observations. Computing such an estimator is a very timeconsuming task, and the computational burden rises dramatically as the number of observations increases. By introdu...
متن کاملLeast squares tracking on the Euclidean group
A large class of problems in robotics, e.g., trajectory tracking with obstacle avoidance, compliant motion control, and complex assembly, can be formulated as a least-squares tracking problem on the Euclidean group subject to constraints on the state and/or control. In this note we develop an optimal control framework for this general class of problems, and derive analytic solutions for the loc...
متن کاملLeast Absolute Shrinkage is Equivalent to Quadratic Penalization
Adaptive ridge is a special form of ridge regression, balancing the quadratic penalization on each parameter of the model. This paper shows the equivalence between adaptive ridge and lasso (least absolute shrinkage and selection operator). This equivalence states that both procedures produce the same estimate. Least absolute shrinkage can thus be viewed as a particular quadratic penalization. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012